Exact Random Coding Exponents and Universal Decoders for the Asymmetric Broadcast Channel
نویسندگان
چکیده
منابع مشابه
Exact Random Coding Exponents and Universal Decoders for the Asymmetric Broadcast Channel
This work contains two main contributions concerning the asymmetric broadcast channel. The first is an analysis of the exact random coding error exponents for both users, and the second is the derivation of universal decoders for both users. These universal decoders are certain variants of the maximum mutual information (MMI) universal decoder, which achieve the corresponding random coding expo...
متن کاملExact Random Coding Error Exponents for the Two-User Interference Channel
This paper is about exact error exponents for the two-user interference channel under the random coding regime. Specifically, we first analyze the standard random coding ensemble, where the codebooks are comprised of independently and identically distributed (i.i.d.) codewords. For this ensemble, we focus on optimum decoding, which is in contrast to other, heuristic decoding rules that have bee...
متن کاملExpurgated Bounds for the Asymmetric Broadcast Channel
This work contains two main contributions concerning the expurgation of hierarchical ensembles for the asymmetric broadcast channel. The first is an analysis of the optimal maximum likelihood (ML) decoders for the weak and strong user. Two different methods of code expurgation will be used, that will provide two competing error exponents. The second is the derivation of expurgated exponents und...
متن کاملExact Prediction and Universal Coding for Trees
No closed formula for the optimal predictor (estimator) exists for the model of order preserving distributions on a finite tree. We present an algorithm of low complexity for a large class of trees. Let T = (T,≤) be a finite rooted tree and consider the model P of all distributions over the nodes of T which respect the ordering (P ∈ P means P (a) ≤ P (b) whenever a ≤ b – hence the root has mini...
متن کاملCapacity Region of the Deterministic Broadcast Channel with Cooperative Decoders
A special case of the discrete memoryless cooperative broadcast channel, as defined by Dabora and Servetto, is investigated. The capacity region is provided in the case where the information messages are sent over a deterministic broadcast channel (Y1, Y2) = h(X) with a (C12, C21)-admissible conference link between the receivers. In this framework we also give the capacity in the single common ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2018
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2018.2836668